An ASP Semantics for Default Reasoning with Constraints
نویسندگان
چکیده
We introduce the logic of Here-and-There with Constraints in order to capture constraint theories in the non-monotonic setting known from Answer Set Programming (ASP). This allows for assigning default values to constraint variables or to leave them undefined. Also, it provides us with a semantic framework integrating ASP and Constraint Processing in a uniform way. We put some emphasis on logic programs dealing with linear constraints on integer variables, where we further introduce a directional assignment operator. We elaborate upon the formal relation and implementation of these programs in terms of Constraint ASP, sketching an existing system.
منابع مشابه
The draculasp System: Default Reasoning about Actions and Change Using Logic and Answer Set Programming
We present an implementation for nonmonotonic reasoning about action domains. Its name draculasp stands for “default reasoning about actions and change using logic and answer set programming.” The system compiles action domain specifications from a logic-based input language into answer set programs and invokes an ASP solver to answer queries about the domain. Intelligent agents can use dracula...
متن کاملCharacterizing and extending answer set semantics using possibility theory
Answer Set Programming (ASP) is a popular framework for modeling combinatorial problems. However, ASP cannot easily be used for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, where this weight is interpreted as the certainty with which the conclusion can be establish...
متن کاملModeling and Language Extensions
Answer Set Programming (ASP) has emerged as an approach to declarative problem solving based on the stable model semantics for logic programs. The basic idea is to represent a computational problem by a logic program, formulating constraints in terms of rules, such that its answer sets correspond to problem solutions. To this end, ASP combines an expressive language for high-level modeling with...
متن کاملAnswer Set Programming's Contributions to Classical Logic - An Analysis of ASP Methodology
Much research in logic programming and non-monotonic reasoning originates from dissatisfaction with classical logic as a knowledge representation language, and with classical deduction as a mode for automated reasoning. Discarding these classical roots has generated many interesting and fruitful ideas. However, to ensure the lasting impact of the results that have been achieved, it is important...
متن کاملOn the Computation of Paracoherent Answer Sets
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning. An ASP program can have no answer set due to cyclic default negation. In this case, it is not possible to draw any conclusion, even if this is not intended. Recently, several paracoherent semantics have been proposed that address this issue, and several potential applications for these semantics have been i...
متن کامل